Reversibility in Erlang: Imperative Constructs
نویسندگان
چکیده
A relevant application of reversibility is causal-consistent reversible debugging, which allows one to explore concurrent computations backward and forward find a bug. This approach has been put into practice in CauDEr, debugger for the Erlang programming language. CauDEr supports functional, distributed fragment Erlang. However, also includes imperative features manage map (shared among all processes same node) associating process identifiers names. Here we extend related theory support such features. From theoretical point view, added primitives create different causal structures than those derived from previously handled yet show that main results proved are still valid.
منابع مشابه
Mechanized Semantics of Simple Imperative Programming Constructs
In this paper a uniform formalization in PVS of various kinds of semantics of imper ative programming language constructs is presented Based on a comprehensive de velopment of xed point theory the denotational semantics of elementary constructs of imperative programming languages are de ned as state transformers These state transformers induce corresponding predicate transformers providing a me...
متن کاملA Methodology to Extend Imperative Languages with AgentSpeak Declarative Constructs
This paper presents a novel technique for the support of declarative constructs of AgentSpeak in a imperative language. Starting from an analysis of the characteristics and semantics of AgentSpeak, as well as the requirements of an AgentSpeak implementation, the paper proposes a framework which, by exploiting object-orientation and operator overloading, is able to enrich an imperative language ...
متن کاملStandard ML-NJ weak polymorphism and imperative constructs
Standard ML of New Jersey (SML-NJ) uses \weak type variables" to restrict the polymorphic use of functions that may allocate reference cells, manipulate continuations, or use exceptions. However, the type system used in the SML-NJ compiler has not previously been presented in a form other than source code nor proved correct. We present a set of typing rules, based on a careful analysis of the c...
متن کاملControl Constructs in a Completely Visual Imperative Programming Language University of Colorado at Boulder Control Constructs in a Completely Visual Imperative Programming Language
Visual representations of programs can facilitate program understanding by presenting aspects of programs using explicit and intuitive representations. We have designed a completely visual static and dynamic representation of an imperative programming language. Because our representation of control is completely visual, programmers of this language can understand the static and dynamic semantic...
متن کاملDDD distribution in Erlang
Decision diagrams are structures used in several domains where memory usage is critical. Data Decision Diagrams (DDD) are a kind of decision diagrams used in model-checking for example. However, they bring a solution to the memory problem that is not always sufficient. To overcome memory limit, a solution is to distribute memory. Some implementations exist for BDD (Binary Decision Diagrams), bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-09005-9_13